Timing Minimization by Statistical Timing hMetis-based Partitioning

نویسندگان

  • Cristinel Ababei
  • Kia Bazargan
چکیده

In this paper we present statistical timing driven hMetisbased partitioning. We approach timing driven partitioning from a different perspective: we use the statistical timing criticality concept to change the partitioning process itself. We exploit the hyperedge coarsening scheme of the hMetis partitioner for our timing minimization purpose. This allows us to perform partitioning such that the most critical nets in the circuit are not cut and therefore timing minimization can be achieved. The use of the hMetis partitioning algorithm makes our partitioning methodology fast. Simulations results show that 22% average delay improvement can be obtained. Furthermore, as a result of using the statistical timing model, the partitioning results can tolerate changes in temperature and process variation, hence causing less delay change compared to partitioning using static timing models.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

TIMING AWARE PARTITIONING FOR MULTI-FPGA BASED LOGIC SIMULATION USING TOP-DOWN SELECTIVE FLATTENING A Thesis by SUBRAMANIAN POOTHAMKURISSI SWAMINATHAN

Timing Aware Partitioning for Multi-FPGA Based Logic Simulation Using Top-down Selective Flattening. (August 2012) Subramanian Poothamkurissi Swaminathan, B.Tech., National Institute of Technology, Trichy, India Chair of Advisory Committee: Dr. Sunil P. Khatri In order to accelerate logic simulation, it is highly beneficial to simulate the circuit design on FPGA hardware. However, limited hardw...

متن کامل

Simultaneous Delay and Power Optimization for Multi-level Partitioning and Floorplanning with Retiming

Delay minimization and power minimization are two important objectives in the design of the high-performance, portable, and wireless computing and communication systems. Retiming is a very effective way for delay optimization for sequential circuits. In this paper we propose a unified framework for multi-level partitioning and floorplanning with retiming, targeting simultaneous delay and power ...

متن کامل

An Accurate and Stochastic-Based Approach to Timing-Driven Partitioning and Placement

We present an accurate new approach to timing-driven partitioning and placement that is particularly suited to deep submicron technology, and to the large circuits that are implemented on such chips. We present rationale for why iterative-improvement based partition-driven placement should be the approach of choice for optimizing any objective like timing, power and area. We establish desirable...

متن کامل

Statistical Timing Driven Partitioning for VLSI Circuits

In this paper we present statistical-timing driven partitioning for performance optimization. We show that by using the concept of node criticality we can enhance the Fiduccia-Mattheyses (FM) partitioning algorithm to achieve more than 20% improvements in terms of timing, among partitions with the same cut size. By incorporating mechanisms for timing optimization at the partitioning level, we f...

متن کامل

Multi-objective Hypergraph Partitioning Algorithms for Cut and Maximum Subdomain Degree Minimization.. Multi-objective Hypergraph Partitioning Algorithms for Cut and Maximum Subdomain Degree Minimization.. Multi-objective Hypergraph Partitioning Algorithms for Cut and Maximum Subdomain Degree Minimization *

In this paper we present a family of multi-objective hypergraph partitioning algorithms based on the multilevel paradigm, which are capable of producing solutions in which both the cut and the maximum subdomain degree are simultaneously minimized. This type of partitionings are critical for existing and emerging applications in VLSI CAD as they allow to both minimize and evenly distribute the i...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003